Universal Continuous Routing
نویسنده
چکیده
In this paper we present routing protocols that are universal in the sense that they route messages along arbitrary (simple or shortest) paths in arbitrary networks. We study these protocols under a stochastic model of continuous message generation. The performance of such protocols is characterized by three parameters: the maximum message generation rate for which the protocol is stable, the expected delay of a message from generation to service, and the time the protocol needs to recover from worst case scenarios. Our main results are a universal continuous store-and-forward routing protocol and a universal continuous wormhole routing protocol. Both protocols yield signiicant performance improvements over all previously known continuous routing protocols. In addition, we present adaptations of our main results to continuous routing in node-symmetric networks, butterries, and meshes.
منابع مشابه
A multi-product vehicle routing scheduling model with time window constraints for cross docking system under uncertainty: A fuzzy possibilistic-stochastic programming
Mathematical modeling of supply chain operations has proven to be one of the most complex tasks in the field of operations management and operations research. Despite the abundance of several modeling proposals in the literature; for vast majority of them, no effective universal application is conceived. This issue renders the proposed mathematical models inapplicable due largely to the fact th...
متن کاملA Programmable Routing Framework for Autonomic Sensor Networks
This paper proposes a programmable routing framework that promotes the adaptivity in routing services for sensor networks. This framework includes a universal routing service and an automatic deployment service. The universal routing service allows the introduction of different services through its tunable parameters and programmable components. The deployment service completes the configuratio...
متن کاملOptimizing location, routing and inventory decisions in an integrated supply chain network under uncertainty
This study extends a mathematical model that integrates the location, allocation, inventory replenishment and routing decisions simultaneously. To cope with inherent uncertainty of parameters, we implement a continuous-time Markov process and derive the performance measures of the system. Using the obtained results, the problem is formulated as a mixed integer nonlinear programing model (MINLP)...
متن کاملUniversal Approximator Property of the Space of Hyperbolic Tangent Functions
In this paper, first the space of hyperbolic tangent functions is introduced and then the universal approximator property of this space is proved. In fact, by using this space, any nonlinear continuous function can be uniformly approximated with any degree of accuracy. Also, as an application, this space of functions is utilized to design feedback control for a nonlinear dynamical system.
متن کاملUniversal Bufferless Routing
In a routing problem, a set of packets must be routed from their sources to their destinations along specified paths in a connected network. Given paths with congestion C and dilation D a lower bound on the routing time is Ω(C + D). The celebrated result of Leighton, Maggs and Rao (1988) established, non-constructively, the existence of a routing schedule which uses constant size buffers and ro...
متن کامل